Indexing metric uncertain data for range queries and range joins
نویسندگان
چکیده
منابع مشابه
Range Queries on Uncertain Data
Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on P to answer range queries of the following three types for any query interval I : (1) top-1 query: find the point in P that lies in I with the highest probability, (2) top-k query: given any integer k ≤ n as part of th...
متن کاملProcessing Probabilistic Range Queries over Gaussian-Based Uncertain Data
Probabilistic range query is an important type of query in the area of uncertain data management. A probabilistic range query returns all the objects within a specific range from the query object with a probability no less than a given threshold. In this paper we assume that each uncertain object stored in the databases is associated with a multi-dimensional Gaussian distribution, which describ...
متن کاملSolving similarity joins and range queries in metric spaces with the list of twin clusters
The metric space model abstracts many proximity or similarity problems, where the most frequently considered primitives are range and k-nearest neighbor search, leaving out the similarity join, an extremely important primitive. In fact, despite the great attention that this primitive has received in traditional and even multidimensional databases, little has been done for general metric databas...
متن کاملIndexing Continual Range Queries for Efficient Stream Processing
A large number of continual range queries could be issued against numerical data streams, such as stock prices, sensor readings, temperatures, and others. To efficiently process these long-running queries, only the potentially relevant queries should be evaluated against the data. We develop a virtual construct-based query indexing approach to efficiently identifying the range queries that matc...
متن کاملUB-Tree Indexing for Semantic Query Optimization of Range Queries
Semantic query optimization consists in restricting the search space in order to reduce the set of objects of interest for a query. This paper presents an indexing method based on UB-trees and a static analysis of the constraints associated to the views of the database and to any constraint expressed on attributes. The result of the static analysis is a partitioning of the object space into dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2017
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-017-0465-6